Enumerating typical abelian coverings of Cayley graphs
نویسندگان
چکیده
منابع مشابه
Enumerating typical abelian prime-fold coverings of a circulant graph
Enumerating the isomorphism classes of several types of graph coverings is one of the central research topics in enumerative topological graph theory (see [R. Feng, J.H. Kwak, J. Kim, J. Lee, Isomorphism classes of concrete graph coverings, SIAM J. Discrete Math. 11 (1998) 265–272; R. Feng, J.H. Kwak, Typical circulant double coverings of a circulant graph, Discrete Math. 277 (2004) 73–85; R. F...
متن کاملNORMAL 6-VALENT CAYLEY GRAPHS OF ABELIAN GROUPS
Abstract : We call a Cayley graph Γ = Cay (G, S) normal for G, if the right regular representation R(G) of G is normal in the full automorphism group of Aut(Γ). In this paper, a classification of all non-normal Cayley graphs of finite abelian group with valency 6 was presented.
متن کاملEnumerating planar locally finite Cayley graphs
We characterize the set of planar locally finite Cayley graphs, and give a finite representation of these graphs by a special kind of finite state automata called labeling schemes. As a result, we are able to enumerate and describe all planar locally finite Cayley graphs of a given degree. This analysis allows us to solve the problem of decision of the locally finite planarity for a word-proble...
متن کاملOn Cayley Graphs of Abelian Groups
Let G be a finite Abelian group and Cay(G, S) the Cayley (di)-graph of G with respect to S, and let A = Aut Cay(G, S) and A1 the stabilizer of 1 in A. In this paper, we first prove that if A1 is unfaithful on S then S contains a coset of some nontrivial subgroup of G, and then characterize Cay(G, S) if AS 1 contains the alternating group on S. Finally, we precisely determine all m-DCI p-groups ...
متن کاملBounding neighbor-connectivity of Abelian Cayley graphs
For the notion of neighbor-connectivity in graphs whenever a vertex is subverted the entire closed neighborhood of the vertex is deleted from the graph. The minimum number of vertices whose subversion results in an empty, complete, or disconnected subgraph is called the neighborconnectivity of the graph. Gunther, Hartnell, and Nowakowski have shown that for any graph, neighbor-connectivity is b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2013
ISSN: 0012-365X
DOI: 10.1016/j.disc.2013.03.021